Non-binary low-density parity-check codes are robust to various channelimpairments. However, based on the existing decoding algorithms, the decoderimplementations are expensive because of their excessive computationalcomplexity and memory usage. Based on the combinatorial optimization, wepresent an approximation method for the check node processing. The simulationresults demonstrate that our scheme has small performance loss over theadditive white Gaussian noise channel and independent Rayleigh fading channel.Furthermore, the proposed reduced-complexity realization provides significantsavings on hardware, so it yields a good performance-complexity tradeoff andcan be efficiently implemented.
展开▼
